Sixtors and Mod 6 Computations
نویسنده
چکیده
We consider the following phenomenon: with just one multiplication we can compute (3u+2v)(3x+2y) ≡ 3ux+4vy (mod 6), while computing the same polynomial modulo 5 needs 2 multiplications. We generalize this observation and we define some vectors, called sixtors, with remarkable zero-divisor properties. Using sixtors, we also generalize our earlier result (Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications, SIAM Journal on Computing, Vol. 32. No. 6.) for fast computation of wider classes of multi-variate polynomials, modulo composites.
منابع مشابه
A role for generalized Fermat numbers
We define a Gauss factorial Nn! to be the product of all positive integers up to N that are relatively prime to n ∈ N. In this paper we study particular aspects of the Gauss factorials bn−1 M cn! for M = 3 and 6, where the case of n having exactly one prime factor of the form p ≡ 1 (mod 6) is of particular interest. A fundamental role is played by those primes p ≡ 1 (mod 3) with the property th...
متن کاملON THE WEIGHTS OF MOD p HILBERT MODULAR FORMS
We prove many cases of a conjecture of Buzzard, Diamond and Jarvis on the possible weights of mod p Hilbert modular forms, by making use of modularity lifting theorems and computations in p-adic Hodge theory.
متن کاملChapter V the Homotopy Groups of H Ring Spectra
This section contains statements of our results on homotopy operations as well as some applications of these results. The proofs depend on material in §2 and will be given in §3Note that, aside from the computations in ~,S at the end of this section, all the results here apply to the homotopy of any H ring spectrum Y. Let ~:DpY + Y denote the structure map. The order of results in this section ...
متن کاملN ) Efficiently in ANSI C
The modular product computation A*B (mod N) is a bottleneck for some public-key encryption algorithms, as well as many exact computations implemented using the Chinese Remainder Theorem. We show how to compute A*B (mod N) efficiently, for single-precision A,B, and N, on a modern RISC architecture (Intel 80860) in ANSI C. On this architecture, our method computes A*B (mod N) faster than ANSI C c...
متن کاملOrders in Modular Arithmetic
Example 1.1. Let m = 7. The following table shows that the first time a nonzero number mod 7 has a power congruent to 1 varies. While Fermat’s little theorem tells us that a6 ≡ 1 mod 7 for a 6≡ 0 mod 7, we see in the table that the exponent 6 can be replaced by a smaller positive exponent for 1, 2, 4, and 6. k 1 2 3 4 5 6 1k mod 7 1 2k mod 7 2 4 1 3k mod 7 3 2 6 4 5 1 4k mod 7 4 2 1 5k mod 7 5 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2003